Fast Leaf-to-Root Holistic Twig Query on XML Spatiotemporal Data
نویسندگان
چکیده
With the increasing applications based on location, the researches on spatiotemporal data, especially queries of spatiotemporal data have attracted a lot of attention. XML, as a standard language of information exchanging over the Web, should have the ability to query spatiotemporal data. In this paper, we propose an algorithm, TwigSPFast, for matching a spatiotemporal XML query twig pattern. We represent spatiotemporal data by adding spatial and temporal attributes in common data and extend Dewey code to mark spatiotemporal data for special process and determine structure relationship of spatiotemporal nodes. Our technique uses streams to store leaf nodes in XML corresponding to leaf query node and filters the streams to delete unmatched nodes, after filtering, we build output list for every matched leaf node that matches the query path from leaf node to root. It can be proved that TwigSPFast is optimal in time complexity and space complexity.
منابع مشابه
Querying Spatiotemporal Data Based on XML Twig Pattern
With the increasing applications based on location, researches on spatiotemporal data, especially queries of spatiotemporal data have attracted a lot of attention. XML, as a standard language of information exchanging over the Web, has the ability to query spatiotemporal data. In this paper, we propose an algorithm, TwigStackSP, for matching a spatiotemporal XML query twig pattern. We represent...
متن کاملQuickStack: A Fast Algorithm for XML Query Matching
With the increasing popularity of XML for data representation and exchange, much research has been done for providing an efficient way to evaluate twig patterns in an XML database. As a result, many holistic join algorithms have been developed, most of which are derivatives of the well-known TwigStack algorithm. However, these algorithms still apply a two phase processing scheme: first identify...
متن کاملTRACK : A Novel XML Join Algorithm for Efficient Processing Twig Queries
In order to find all occurrences of a tree/twig pattern in an XML database, a number of holistic twig join algorithms have been proposed. However, most of these algorithms focus on identifying a larger query class or using a novel label scheme to reduce I/O operations, and ignore the deficiency of the root-to-leaf strategy. In this paper, we propose a novel twig join algorithm called Track, whi...
متن کاملEfficient Holistic Twig Joins in Leaf-to-Root Combining with Root-to-Leaf Way
Finding all the occurrences of a twig pattern on multiple elements in an XML document is a core operation for efficient evaluation of XML queries. Holistic twig join algorithms, TwigStack and TSGeneric, have been recognized as optimal solutions when the twig pattern only involves A-D(ancestor-descendant) relationships, while iTwigJoin can be optimal for partial twig patterns that contain A-D on...
متن کاملEfficient XML tree pattern query evaluation using a novel one-phase holistic twig join scheme
Purpose of this paper This paper aims to provide an efficient algorithm for XML twig query evaluation. Design/Methodology/Approach In this chapter, we propose a single-phase holistic twig pattern matching method based on the TwigStack algorithm. Our method applies a novel stack structure to preserve the holisticity of the twig matches. Twig matches rooted at elements that are currently in the r...
متن کاملذخیره در منابع من
با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید
برای دانلود متن کامل این مقاله و بیش از 32 میلیون مقاله دیگر ابتدا ثبت نام کنید
ثبت ناماگر عضو سایت هستید لطفا وارد حساب کاربری خود شوید
ورودعنوان ژورنال:
- JCP
دوره 12 شماره
صفحات -
تاریخ انتشار 2017